Approximate eigenvectors as preconditioner
نویسندگان
چکیده
منابع مشابه
Toward an Effective Sparse Approximate Inverse Preconditioner
Sparse approximate inverse preconditioners have attracted much attention recently, because of their potential usefulness in a parallel environment. In this paper, we explore several performance issues related to effective sparse approximate inverse preconditioners (SAIPs) for the matrices derived from PDEs. Our refinements can significantly improve the quality of existing SAIPs and/or reduce th...
متن کاملA Factored Approximate Inverse Preconditioner with Pivoting
In this paper we develop new techniques for stabilizing factored approximate inverse preconditioners (AINV) using pivoting. This method yields stable preconditioners in many cases and can provide successful preconditioners in many situations when the underlying system is highly indefinite. Numerical examples illustrate the effectiveness of this approach.
متن کاملA Kronecker product approximate preconditioner for SANs
Many very large Markov chains can be modelled e ciently as stochastic automata networks (SANs). A SAN is composed of individual automata which, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov chain compactly as the sum of Kronecker products of smaller matrices. Thus, storage savings are immediate. The be...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...
متن کاملA Two-Level Parallel Preconditioner Based on Sparse Approximate Inverses
We introduce a novel strategy for parallel preconditioning of large-scale linear systems by means of a two-level factorized sparse approximate inverse algorithm. Using graph partitioning and incomplete biconjugation we are able to obtain a highly parallel preconditioner. The algorithm has been implemented using MPI on a SGI Origin 2000 computer at Los Alamos National Laboratory and is currently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00046-x